Decomposing infinite matroids into their 3-connected minors

s Elgersburg 2011 Rainbow Cycles in Cube Graphs Jens-P. Bode (Technische Universität Braunschweig) Joint work with A. Kemnitz and S. Struckmann A graph G is called rainbow with respect to an edge coloring if no two edges of G have the same color. Given a host graph H and a guest graph G ⊆ H, an edge coloring of H is called G-anti-Ramsey if no subgraph of H isomorphic to G is rainbow. The anti-Ramsey number f(H,G) is the maximum number of colors for which there is a G-anti-Ramsey edge coloring of H. We consider cube graphs Qn as host graphs and even cycles Ck as guest graphs. Induced Decompositions of Graphs J. Adrian Bondy (Université Lyon 1 and Université Paris 6) We consider those graphs G which admit decompositions into copies of a fixed graph F , each copy being an induced subgraph of G. We are interested in finding the extremal graphs with this property, that is, those graphs G on n vertices with the maximum possible number of edges. We report on joint work with Jayme Szwarcfiter concerning the cases where F is a complete r-partite graph, a cycle, a star, or a graph on at most four vertices. We also discuss recent contributions to the topic by Nathann Cohen and Zsolt Tuza.